Parallel Solution of Covering Problems Super-Linear Speedup on a Small Set of Cores
نویسندگان
چکیده
This paper aims at better possibilities to solve problems of exponential complexity. Our special focus is the combination of the computational power of four cores of a standard PC with better approaches in the application domain. As the main example we selected the unate covering problem which must be solved, among others, in the process of circuit synthesis and for graph-covering (domination) problems. We introduce into the wide field of problems that can be solved using Boolean models. We explain the models and the classic solutions, and discuss the results of a selected model by using a benchmark set. Subsequently we study sources of parallelism in the application domain and explore improvements given by the parallel utilization of the available four cores of a PC. Starting with a uniform splitting of the problem, we suggest improvements by means of an adaptive division and an intelligent master. Our experimental results confirm that the combination of improvements of the application models and of the algorithmic domain leads to a remarkable speedup and an overall improvement factor of more than 35 millions in comparison with the improved basic approach. Keywords-covering; XBOOLE; ternary vector; parallel; message passing interface; unate SAT problems; Boolean models
منابع مشابه
Parallel Solution of Covering Problems Better Models and Algorithms
This paper aims at better possibilities to solve problems with exponential complexity. Our special focus is on the combination of using four cores of a standard PC together with better models in the application domain. As example we selected the unate covering problem, which must be solved, among others, in the process of circuit synthesis and for graph covering (domination) problems. We introd...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملParallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counterparts in order, e.g., to tackle more complex problems. This naturally leads to measuring the speedup of the PEA. PEAs have sometimes been reported to provide super-linear performances for different problems, parameteri...
متن کامل